Classes of line graphs with small cycle double covers
نویسندگان
چکیده
The Small Cycle Double Cover Conjectnre, due to J .A. Bondy, states that every simple bridgeless graph on n vertices has a cycle double cover with at most (n 1) cycles. There are a number of classes of graphs for which this conjecture is known to hold; for example, triangulations of surfaces, complete graphs, and 4-connected planar graphs. In this article, we prove that the conjecture holds for line graphs of a number of types of graphs; specifically line graphs of complete graphs, line graphs of complete bipartite graphs, and line graphs of planar graphs.
منابع مشابه
Construction of Cycle Double Covers for certain classes of graphs
We introduce two classes of graphs, Indonesian graphs and k-doughnut graphs. Cycle double covers are constructed for these classes. In case of doughnut graphs this is done for the values k = 1, 2, 3 and 4.
متن کاملEven cycle decompositions of 4-regular graphs and line graphs
An even cycle decomposition of a graph is a partition of its edge into even cycles. We first give some results on the existence of even cycle decomposition in general 4-regular graphs, showing that K5 is not the only graph in this class without such a decomposition. Motivated by connections to the cycle double cover conjecture we go on to consider even cycle decompositions of line graphs of 2-c...
متن کاملShortest cycle covers and cycle double covers with large 2-regular subgraphs
In this paper we show that many snarks have shortest cycle covers of length 43m + c for a constant c, where m is the number of edges in the graph, in agreement with the conjecture that all snarks have shortest cycle covers of length 43m+ o(m). In particular we prove that graphs with perfect matching index at most 4 have cycle covers of length 4 3m and satisfy the (1, 2)-covering conjecture of Z...
متن کاملCubic graphs with large circumference deficit
The circumference c(G) of a graph G is the length of a longest cycle. By exploiting our recent results on resistance of snarks, we construct infinite classes of cyclically 4-, 5and 6-edge-connected cubic graphs with circumference ratio c(G)/|V (G)| bounded from above by 0.876, 0.960 and 0.990, respectively. In contrast, the dominating cycle conjecture implies that the circumference ratio of a c...
متن کاملEdge pair sum labeling of some cycle related graphs
Let G be a (p,q) graph. An injective map f : E(G) → {±1,±2,...,±q} is said to be an edge pair sum labeling if the induced vertex function f*: V (G) → Z - {0} defined by f*(v) = ΣP∈Ev f (e) is one-one where Ev denotes the set of edges in G that are incident with a vertex v and f*(V (G)) is either of the form {±k1,±k2,...,±kp/2} or {±k1,±k2,...,±k(p-1)/2} U {±k(p+1)/2} according as p is even or o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 24 شماره
صفحات -
تاریخ انتشار 2001